Lattice based extended formulations for integer linear equality systems
نویسندگان
چکیده
منابع مشابه
Lattice based extended formulations for integer linear equality systems
We study different extended formulations for the set X = {x ∈ Zn | Ax = Ax} in order to tackle the feasibility problem for the set X+ = X∩Zn+. Here the goal is not to find an improved polyhedral relaxation of conv(X+), but rather to reformulate in such a way that the new variables introduced provide good branching directions, and in certain circumstances permit one to deduce rapidly that the in...
متن کاملCore Discussion Paper 2007/17 Lattice Based Extended Formulations for Integer Linear Equality Systems
We study different extended formulations for the set X = {x ∈ Z | Ax = Ax} in order to tackle the feasibility problem for the set X+ = X ∩ Z+. Here the goal is not to find an improved polyhedral relaxation of conv(X+), but rather to reformulate in such a way that the new variables introduced provide good branching directions, and in certain circumstances permit one to deduce rapidly that the in...
متن کاملa new type-ii fuzzy logic based controller for non-linear dynamical systems with application to 3-psp parallel robot
abstract type-ii fuzzy logic has shown its superiority over traditional fuzzy logic when dealing with uncertainty. type-ii fuzzy logic controllers are however newer and more promising approaches that have been recently applied to various fields due to their significant contribution especially when the noise (as an important instance of uncertainty) emerges. during the design of type- i fuz...
15 صفحه اولExtended Formulations in Mixed-Integer Convex Programming
We present a unifying framework for generating extended formulations for the polyhedral outer approximations used in algorithms for mixed-integer convex programming (MICP). Extended formulations lead to fewer iterations of outer approximation algorithms and generally faster solution times. First, we observe that all MICP instances from the MINLPLIB2 benchmark library are conic representable wit...
متن کاملDis-equality Constraints in Linear/integer Programming
We have proposed an extension to the deenition of general integer linear programs (ILP) to accept dis-equality constraints explicitly. A new class of logical variables is introduced to transform the extended ILP in general form to standard form. Branch and Bound algorithm is modiied to solve this new class of ILP.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Programming
سال: 2008
ISSN: 0025-5610,1436-4646
DOI: 10.1007/s10107-008-0236-7